On the equational consistency of order-theoretic models of the λ-calculus∗
نویسندگان
چکیده
Answering a question by Honsell and Plotkin, we show that there are two equations between λ-terms, the so-called subtractive equations, consistent with λ-calculus but not satisfied in any partially ordered model with bottom element. We also relate the subtractive equations to the open problem of the order-incompleteness of λ-calculus. 1998 ACM Subject Classification F.4.1 Lambda calculus and related systems
منابع مشابه
On the completeness of order-theoretic models of the λ-calculus
Scott discovered his domain-theoretic models of the λ-calculus, isomorphic to their function space, in 1969. A natural completeness problem then arises: whether any two terms equal in all Scott models are convertible. There is also an analogous consistency problem: whether every equation between two terms, consistent with the λ-calculus, has a Scott model. We consider such questions for wider s...
متن کاملEffective λ-models versus recursively enumerable λ-theories
A longstanding open problem is whether there exists a non-syntactical model of the untyped λ-calculus whose theory is exactly the least λ-theory λβ . In this paper we investigate the more general question of whether the equational/order theory of a model of the untyped λ-calculus can be recursively enumerable (r.e. for brevity). We introduce a notion of effective model of λ-calculus, which cove...
متن کاملEffective lambda-models vs recursively enumerable lambda-theories
A longstanding open problem is whether there exists a non-syntactical model of the untyped λ-calculus whose theory is exactly the least λ-theory λβ . In this paper we investigate the more general question of whether the equational/order theory of a model of the untyped λ-calculus can be recursively enumerable (r.e. for brevity). We introduce a notion of effective model of λ-calculus, which cove...
متن کاملA kappa-Denotational Semantics for Map Theory in ZFC + SI
Map theory, or MT for short, has been designed as an “integrated” foundation for mathematics, logic and computer science. By this we mean that most primitives and tools are designed from the beginning to bear the three intended meanings: logical, computational, and set-theoretic. MT was originally introduced in [18]. It is based on λ-calculus instead of logic and sets, and it fulfills Church’s ...
متن کاملOn the equational consistency of order-theoretic models of the ⁄-calculusú
Answering a question by Honsell and Plotkin, we show that there are two equations between ⁄-terms, the so-called subtractive equations, consistent with ⁄-calculus but not satisfied in any partially ordered model with bottom element. We also relate the subtractive equations to the open problem of the order-incompleteness of ⁄-calculus. 1998 ACM Subject Classification F.4.1 Lambda calculus and re...
متن کامل